Laws of Large Numbers for a Cellular Automaton

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Laws of Large Numbers for Random Linear

The computational solution of large scale linear programming problems contains various difficulties. One of the difficulties is to ensure numerical stability. There is another difficulty of a different nature, namely the original data, contains errors as well. In this paper, we show that the effect of the random errors in the original data has a diminishing tendency for the optimal value as the...

متن کامل

ON THE LAWS OF LARGE NUMBERS FOR DEPENDENT RANDOM VARIABLES

In this paper, we extend and generalize some recent results on the strong laws of large numbers (SLLN) for pairwise independent random variables [3]. No assumption is made concerning the existence of independence among the random variables (henceforth r.v.’s). Also Chandra’s result on Cesàro uniformly integrable r.v.’s is extended.

متن کامل

Catalan Numbers and Power Laws in Cellular Automaton Rule 14

We discuss example of an elementary cellular automaton for which the density of ones decays toward its limiting value as a power of the number of iterations n. Using the fact that this rule conserves the number of blocks 10 and that preimages of some other blocks exhibit patterns closely related to patterns observed in rule 184, we derive expressions for the number of n-step preimages of all bl...

متن کامل

on the laws of large numbers for dependent random variables

in this paper, we extend and generalize some recent results on the strong laws of large numbers (slln) for pairwise independent random variables [3]. no assumption is made concerning the existence of independence among the random variables (henceforth r.v.’s). also chandra’s result on cesàro uniformly integrable r.v.’s is extended.

متن کامل

A Cellular Automaton Based Algorithm for Mobile Sensor Gathering

In this paper we proposed a Cellular Automaton based local algorithm to solve the autonomously sensor gathering problem in Mobile Wireless Sensor Networks (MWSN). In this problem initially the connected mobile sensors deployed in the network and goal is gather all sensors into one location. The sensors decide to move only based on their local information. Cellular Automaton (CA) as dynamical sy...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Annals of Probability

سال: 1993

ISSN: 0091-1798

DOI: 10.1214/aop/1176989124